On N = 1 $$ \mathcal{N}=1 $$ partition functions without R-symmetry
نویسندگان
چکیده
منابع مشابه
Extending connectivity functions on R n ✩
A function f :Rn →R is a connectivity function if for every connected subset C of Rn the graph of the restriction f C is a connected subset of Rn+1, and f is an extendable connectivity function if f can be extended to a connectivity function g :Rn+1 → R with Rn embedded into Rn+1 as Rn × {0}. There exists a connectivity function f :R→ R that is not extendable. We prove that for n 2 every connec...
متن کاملR-symmetry of Heterotic N=2 Supergravities
The topological twist of N=2, D=4 matter-coupled supergravities requires a suitable R-symmetry. This symmetry is realised in the effective supergravities arising at tree level from certain heterotic compactifications. The set of in-stanton equations (topological gauge-fixings) is thus obtained. The conditions that R-symmetry should satisfy also when these theories are replaced by their " exact ...
متن کاملOn Vector Partition Functions
Vector part i t ion functions appear in m a n y areas of mathemat ics and its applications, including representat ion theory [ 9 ] , commuta t ive algebra [ 14], approximat ion theory [ 4 ] and statistics [5 ] . It was shown by Blakley [ 2 ] that there exists a finite decomposi t ion of N d such that ~b A is a polynomial of degree n d on each piece. Here we describe such a decomposi t ion expli...
متن کاملON THE DOMAIN WALL PARTITION FUNCTIONS OF LEVEL-1 AFFINE so(n) VERTEX MODELS
In [1], Korepin introduced domain wall (DW) boundary conditions in the context of the six vertex, spin-1/2 or level-1 A (1) 1 model on a finite lattice, and obtained recursion relations that determine the partition function in that case. In [2], Izergin solved Korepin’s recursion relations and obtained a determinant expression for the level-1 A (1) 1 DW partition function. In [3], determinant e...
متن کاملSymmetry Partition Sort
In this paper, we propose a useful replacement for quicksort-style utility functions. The replacement is called Symmetry Partition Sort, which has essentially the same principle as Proportion Extend Sort. The maximal difference between them is that the new algorithm always places already partially sorted inputs (used as a basis for the proportional extension) on both ends when entering the part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2015
ISSN: 1029-8479
DOI: 10.1007/jhep03(2015)132